Scenario Submodular Cover

Many problems in Machine Learning can be modeled as submodular optimization problems. Recent work has focused on stochastic or adaptive versions of these problems. We consider the Scenario Submodular Cover problem, which is a counterpart to the Stochastic Submodular Cover problem studied by Golovin and Krause (2011). In Scenario Submodular Cover, the goal is to produce a cover with minimum expected cost, where the expectation is with respect to an empirical joint distribution, given as input by a weighted sample of realizations. In contrast, in Stochastic Submodular Cover, the variables of the input distribution are assumed to be independent, and the distribution of each variable is given as input. Building on algorithms developed by Cicalese et al. (2014) and Golovin and Krause (2011) for related problems, we give two approximation algorithms for Scenario Submodular Cover over discrete distributions. The first achieves an approximation factor of O(logQm), where m is the size of the sample and Q is the goal utility. The second, simpler algorithm achieves an approximation bound of O(logQW ), where Q is the goal utility and W is the sum of the integer weights. (Both bounds assume an integer-valued utility function.) Our results yield approximation bounds for other problems involving non-independent distributions that are explicitly specified by their support. ∗ Partially Supported by NSF Grant 1217968 c © 2016 N. Grammel, L. Hellerstein, D. Kletenik & P. Lin. ar X iv :1 60 3. 03 15 8v 1 [ cs .D S] 1 0 M ar 2 01 6 Grammel Hellerstein Kletenik Lin